منابع مشابه
Reconstructing Visible Regions from Visible Segments
An algorithm is presented for reconstructing visible regions from visible edge segments in object space. This has applications in hidden surface algorithms operating on polyhedral scenes and in cartography. A special case of reconstruction can be formulated as a graph problem: "Determine the faces of a straight-edge planar graph given in terms of its edges." This is accomplished in O(n log n) t...
متن کاملEndovascular coil visible in a visible vessel.
was being admitted for chemotherapy for stage IV ovarian cancer. After large−vol− ume resuscitation, upper gastrointestinal endoscopy was performed because of hematemesis. A large ulcer (2 2 cm) in the posterior wall of the duodenal bulb with a large, actively bleeding visible ves− sel (estimated diameter 5 ± 6 mm) was seen. Despite repeated local epinephrine injections, heater probe coagulat...
متن کاملCross-Calibration between ASTER and MODIS Visible to Near-Infrared Bands for Improvement of ASTER Radiometric Calibration
Radiometric cross-calibration between the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) and the Terra-Moderate Resolution Imaging Spectroradiometer (MODIS) has been partially used to derive the ASTER radiometric calibration coefficient (RCC) curve as a function of date on visible to near-infrared bands. However, cross-calibration is not sufficiently accurate, since the ...
متن کاملPotentially Visible Set (PVS)
Many graphics applications today have to cope with large amounts of data. A popular approach to reduce the amount of geometry to be rendered is to precompute visibility in order to render only objects that can be seen from the given viewpoint. This paper presents one technique to achieve this, potentially visible sets (PVS). These sets are used to avoid rendering hidden objects, especially geom...
متن کاملReticulation-Visible Networks
Let X be a finite set, N be a reticulation-visible network on X, and T be a rooted binary phylogenetic tree. We show that there is a polynomial-time algorithm for deciding whether or not N displays T . Furthermore, for all |X| ≥ 1, we show that N has at most 8|X| − 7 vertices in total and at most 3|X| − 3 reticulation vertices, and that these upper bounds are sharp.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Neuroscience
سال: 2008
ISSN: 1471-003X,1471-0048
DOI: 10.1038/nrn2409